On Retiming for FPGA Logic Module Minimization

نویسندگان

  • Yao-Ping Chen
  • Martin D. F. Wong
چکیده

Y. P. Chen and D. F. Wong Department of Computer Sciences The University of Texas at Austin Austin, Texas 78712 Abstract In this paper, we consider the problem of minimizing the number of logic modules for Actel 2 or Actel 3 sequential circuits. We make use of the fact that if a ipop is the only destination of its driving combinational block, then both the ipop and the combinational block can be put in a sequential module. Retiming technique is applied to minimize the number of registers that can not be merged with combinational blocks. We formulate the problem as an integer linear program. We show that the constraint matrix of the integer program is totally unimodular. As a result, we can solve our logic module minimization problem optimally by solving the linear relaxation of the integer program.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An efficient algorithm for performance-optimal FPGA technology mapping with retiming

It is known that most field programmable gate array (FPGA) mapping algorithms consider only combinational circuits. Pan and Liu [22] recently proposed a novel algorithm, named SeqMapII, of technology mapping with retiming for clock period minimization. Their algorithm, however, requires O(Kn log(Kn) logn) run time and O(Kn) space for sequential circuits with n gates. In practice, these requirem...

متن کامل

An Eecient Algorithm for Performance-optimal Fpga Technology Mapping with Retiming

It is known that most FPGA mapping algorithms consider only combinational circuits. Pan and Liu 22] recently proposed a novel algorithm, named SeqMapII, of technology mapping with retiming for clock period minimization. Their algorithm, however, requires O(K 3 n 5 log(Kn 2)log n) runtime and O(K 2 n 2) space for sequential circuits with n gates. In practice, these requirement are too high for t...

متن کامل

Retiming and resynthesis: optimizing sequential networks with combinational techniques

Sequential networks contain combinational logic blocks separated by registers. Application of combinational logic minimization techniques to the separate logic blocks results in improvement that is restricted by the placement of the registers; information about logical dependencies between blocks separated by registers is not utilized. Temporarily moving all the registers to the periphery of a ...

متن کامل

Integrating Logic Synthesis, Technology Mapping, and Retiming

This paper presents a synthesis method that combines logic synthesis, technology mapping, and retiming into a single integrated flow. The proposed integrated method is applicable to both standard cell and FPGA designs. An efficient implementation is proposed using sequential And-Inverter Graphs. Experiments on a variety of industrial circuits from the IWLS 2005 benchmark set show an average red...

متن کامل

Retiming Level-Clocked Circuits for Latch Count Minimization

Retiming is a powerful transformation that can minimize the number of memory elements in a sequential circuit under clock period constraints. Recent research has led to the development of extremely fast algorithms for retiming edge-triggered circuits. However, level-clocked circuits have the potential to operate faster and require less memory elements than edgetriggered circuits. This paper add...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Integration

دوره 24  شماره 

صفحات  -

تاریخ انتشار 1994